Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus
نویسندگان
چکیده
منابع مشابه
Classical vs. Quantum Read-Once Branching Programs
A simple, explicit boolean function on 2n input bits is presented that is computable by errorfree quantum read-once branching programs of size O(n), while each classical randomized read-once branching program and each quantum OBDD for this function with bounded twosided error requires size 2.
متن کاملQuantum vs. Classical Read-Once Branching Programs
The paper presents the first nontrivial upper and lower bounds for (nonoblivious) quantum read-once branching programs. It is shown that the computational power of quantum and classical read-once branching programs is incomparable in the following sense: (i) A simple, explicit boolean function on 2n input bits is presented that is computable by error-free quantum read-once branching programs of...
متن کاملProofs of proximity for context-free languages and read-once branching programs
Proofs of proximity are probabilistic proof systems in which the verifier only queries a sublinear number of input bits, and soundness only means that, with high probability, the input is close to an accepting input. In their minimal form, called Merlin-Arthur proofs of proximity (MAP), the verifier receives, in addition to query access to the input, also free access to an explicitly given shor...
متن کاملProofs of Proximity for Context-Free Languages and Read-Once Branching Programs - (Extended Abstract)
Proofs of proximity are probabilistic proof systems in which the verifier only queries a sublinear number of input bits, and soundness only means that, with high probability, the input is close to an accepting input. In their minimal form, called Merlin-Arthur proofs of proximity (MAP), the verifier receives, in addition to query access to the input, also free access to an explicitly given shor...
متن کاملRandomness and Nondeterminism are Incomparable for Read-Once Branching Programs
We extend the tools for proving lower bounds for randomized branching programs by presenting a new technique for the read-once case which is applicable to a large class of functions. This technique fills the gap between simple methods only applicable for OBDDs and the well-known “rectangle technique” of Borodin, Razborov and Smolensky which works for the quite general models of nondeterministic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: COMBINATORICA
سال: 2002
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-002-0007-7